au.\*:("TAN, Kian-Lee")
Results 1 to 25 of 117
Selection :
Rapid retrival of protein structures from databasesAUNG, Zeyar; TAN, Kian-Lee.Drug discovery today. 2007, Vol 12, Num 17-18, pp 732-739, issn 1359-6446, 8 p.Article
Rapid 3D protein structure database searching using information retrieval techniquesAUNG, Zeyar; TAN, Kian-Lee.Bioinformatics (Oxford. Print). 2004, Vol 20, Num 7, pp 1045-1052, issn 1367-4803, 8 p.Article
Mining gene expression data for positive and negative co-regulated gene clustersLIPING JI; TAN, Kian-Lee.Bioinformatics (Oxford. Print). 2004, Vol 20, Num 16, pp 2711-2718, issn 1367-4803, 8 p.Article
Identifying time-lagged gene clusters using gene expression dataLIPING JI; TAN, Kian-Lee.Bioinformatics (Oxford. Print). 2005, Vol 21, Num 4, pp 509-516, issn 1367-4803, 8 p.Article
Disseminating streaming data in a dynamic environment : an adaptive and cost-based approachYONGLUAN ZHOU; BENG CHIN OOI; TAN, Kian-Lee et al.The VLDB journal. 2008, Vol 17, Num 6, pp 1465-1483, issn 1066-8888, 19 p.Article
Authenticating query results in edge computingPANG, Hweehwa; TAN, Kian-Lee.International Conference on data engineering. 2004, pp 560-571, isbn 0-7695-2065-0, 1Vol, 12 p.Conference Paper
Querying high-dimensional data in single-dimensional spaceCUI YU; BRESSAN, Stéphane; BENG CHIN OOI et al.The VLDB journal. 2004, Vol 13, Num 2, pp 105-119, issn 1066-8888, 15 p.Article
SABRE: a Sensitive Attribute Bucketization and REdistribution framework for t-closenessJIANNENG CAO; KARRAS, Panagiotis; KALNIS, Panos et al.The VLDB journal. 2011, Vol 20, Num 1, pp 59-81, issn 1066-8888, 23 p.Article
Efficient Dynamic Operator Placement in a Locally Distributed Continuous Query SystemYONGLUAN ZHOU; BENG CHIN OOI; TAN, Kian-Lee et al.Lecture notes in computer science. 2006, pp 54-71, issn 0302-9743, isbn 3-540-48287-3, 18 p.Conference Paper
Hiding data accesses in steganographic file systemZHOU, Xuan; PANG, Hweehwa; TAN, Kian-Lee et al.International Conference on data engineering. 2004, pp 572-583, isbn 0-7695-2065-0, 1Vol, 12 p.Conference Paper
Sort-sharing-aware query processingYU CAO; BRAMANDIA, Ramadhana; CHAN, Chee-Yong et al.The VLDB journal. 2012, Vol 21, Num 3, pp 411-436, issn 1066-8888, 26 p.Article
Best papers of VLDB 2010ATZENI, Paolo; BERTINO, Elisa; KITSUREGAWA, Masaru et al.The VLDB journal. 2012, Vol 21, Num 2, issn 1066-8888, 121 p.Serial Issue
Indexing high-dimensional data for efficient in-memory similarity searchBIN CUI; BENG CHIN OOI; JIANWEN SU et al.IEEE transactions on knowledge and data engineering. 2005, Vol 17, Num 3, pp 339-353, issn 1041-4347, 15 p.Article
Generalized multidimensional data mapping and query processingRUI ZHANG; KALNIS, Panos; BENG CHIN OOI et al.ACM transactions on database systems. 2005, Vol 30, Num 3, pp 661-697, issn 0362-5915, 37 p.Article
Database systems for advanced applications (11th international conference, DASFAA 2006, Singapore, April 12-15, 2006)Lee, Mong Li; Tan, Kian-Lee; Wuwongse, Vilas et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-33337-1, 1Vol, XIX-923 p, isbn 3-540-33337-1Conference Proceedings
Krukenberg tumors of colorectal origin: a dismal outcome—experience of a tertiary centerTAN, Kian-Lee; TAN, Wah-Siew; LIM, Jit-Fong et al.International journal of colorectal disease (Print). 2010, Vol 25, Num 2, pp 233-238, issn 0179-1958, 6 p.Article
BLAST++: BLASTing queries in batchesHAO WANG; BENG CHIN OOI; TAN, Kian-Lee et al.Bioinformatics (Oxford. Print). 2003, Vol 19, Num 17, pp 2323-2324, issn 1367-4803, 2 p.Article
eCEO: an efficient Cloud Epistasis computing model in genome-wide association studyZHENGKUI WANG; YUE WANG; TAN, Kian-Lee et al.Bioinformatics (Oxford. Print). 2011, Vol 27, Num 8, pp 1045-1051, issn 1367-4803, 7 p.Article
Speed up interactive image retrievalHENG TAO SHEN; SHOUXU JIANG; TAN, Kian-Lee et al.The VLDB journal. 2009, Vol 18, Num 1, pp 329-343, issn 1066-8888, 15 p.Article
Compressed hierarchical mining of frequent closed patterns from dense data setsLIPING JI; TAN, Kian-Lee; SOCIETY, Computer et al.IEEE transactions on knowledge and data engineering. 2007, Vol 19, Num 9, pp 1175-1187, issn 1041-4347, 13 p.Article
iDistance : An adaptive B+-tree based indexing method for nearest neighbor searchJAGADISH, H. V; BENG CHIN OOI; TAN, Kian-Lee et al.ACM transactions on database systems. 2005, Vol 30, Num 2, pp 364-397, issn 0362-5915, 34 p.Article
Towards optimal utilization of main memory for moving object indexingBIN CUI; DAN LIN; TAN, Kian-Lee et al.Lecture notes in computer science. 2005, pp 600-611, issn 0302-9743, isbn 3-540-25334-3, 12 p.Conference Paper
Making the pyramid technique robust to query types and workloadsRUI ZHANG; BENG CHIN OOI; TAN, Kian-Lee et al.International Conference on data engineering. 2004, pp 313-324, isbn 0-7695-2065-0, 1Vol, 12 p.Conference Paper
A hash-based collaborative transcoding proxy systemXIU WU; TAN, Kian-Lee.Lecture notes in computer science. 2003, pp 570-582, issn 0302-9743, isbn 3-540-02354-2, 13 p.Conference Paper
Cache-on-demand: Recycling with certaintyTAN, Kian-Lee; GOH, Shen-Tat; BENG CHIN OOI et al.Data engineering. 2001, pp Vol.1.641-Vol.1.650, issn 1063-6382, isbn 0-7695-1001-9, 2VolConference Paper